Algebraic bayesian networks reconciliation: computational complexity
نویسندگان
چکیده
منابع مشابه
Lecture notes: Computational Complexity of Bayesian Networks
Computations such as computing posterior probability distributions and finding joint value assignments with maximum posterior probability are of great importance in practical applications of Bayesian networks. These computations, however, are intractable in general, both when the results are computed exactly and when they are approximated. In order to successfully apply Bayesian networks in pra...
متن کاملThe Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks
Bayesian belief networks provide a natural, efficient method for representing probabilistic dependencies among a set of variables. For these reasons, numerous researchers are exploring the use of belief networks as a knowledge representation m artificial intelligence. Algorithms have been developed previously for efficient probabilistic inference using special classes of belief networks. More g...
متن کاملAn Algebraic Approach to Computational Complexity
The theory of computational complexity is concerned with identifying methods for computing solutions to problems in a minimal number of steps. Despite the diversity of application areas from which such problems can be drawn this theory has been successful in identifying a small number of fundamental questions on which a sizable fraction of the field hangs. A prime example is the P = ?ÎTP questi...
متن کاملAlgebraic Methods in Computational Complexity Dagstuhl Seminar
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are ...
متن کاملAlgebraic geometry of Bayesian networks
We study the algebraic varieties defined by the conditional independence statements of Bayesian networks. A complete algebraic classification is given for Bayesian networks on at most five random variables. Hidden variables are related to the geometry of higher secant varieties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SPIIRAS Proceedings
سال: 2014
ISSN: 2078-9599,2078-9181
DOI: 10.15622/sp.15.9